A Complete Description of Golay Pairs for Lengths up to 100 P. B. Borwein and R. A. Ferguson

نویسنده

  • R. A. FERGUSON
چکیده

In his 1961 paper, Marcel Golay showed how the search for pairs of binary sequences of length n with complementary autocorrelation is at worst a 2 3n 2 −6 problem. Andres, in his 1977 master’s thesis, developed an algorithm which reduced this to a 2 n 2 −1 search and investigated lengths up to 58 for existence of pairs. In this paper, we describe refinements to this algorithm, enabling a 2 n 2 −5 search at length 82. We find no new pairs at the outstanding lengths 74 and 82. In extending the theory of composition, we are able to obtain a closed formula for the number of pairs of length 2kn generated by a primitive pair of length n. Combining this with the results of searches at all allowable lengths up to 100, we identify five primitive pairs. All others pairs of lengths less than 100 may be derived using the methods outlined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A complete description of Golay pairs for lengths up to 100

In his 1961 paper, Marcel Golay showed how the search for pairs of binary sequences of length n with complementary autocorrelation is at worst a 2 3n 2 −6 problem. Andres, in his 1977 master’s thesis, developed an algorithm which reduced this to a 2 n 2 −1 search and investigated lengths up to 58 for existence of pairs. In this paper, we describe refinements to this algorithm, enabling a 2 n 2 ...

متن کامل

A construction of binary Golay sequence pairs from odd-length Barker sequences

Binary Golay sequence pairs exist for lengths 2, 10 and 26 and, by Turyn’s product construction, for all lengths of the form 21026 where a, b, c are non-negative integers. Computer search has shown that all inequivalent binary Golay sequence pairs of length less than 100 can be constructed from five “seed” pairs, of length 2, 10, 10, 20 and 26. We give the first complete explanation of the orig...

متن کامل

Negaperiodic Golay pairs and Hadamard matrices

Apart from the ordinary and the periodic Golay pairs, we define also the negaperiodic Golay pairs. (They occurred first, under a different name, in a paper of Ito.) If a Hadamard matrix is also a Toeplitz matrix, we show that it must be either cyclic or negacyclic. We investigate the construction of Hadamard (and weighing matrices) from two negacyclic blocks (2N-type). The Hadamard matrices of ...

متن کامل

Quaternary Golay sequence pairs I: even length

The origin of all 4-phase Golay sequences and Golay sequence pairs of even length at most 26 is explained. The principal techniques are the three-stage construction of Fiedler, Jedwab and Parker [FJP08] involving multi-dimensional Golay arrays, and a “sum-difference” construction that modifies a result due to Eliahou, Kervaire and Saffari [EKS91]. The existence of 4-phase seed pairs of lengths ...

متن کامل

Equivalence classes and representatives of Golay sequences

We introduce the notion of canonical form for Golay sequences such that every equivalence class contains exactly one member having the canonical form. Golay and Turyn have shown how to multiply Golay sequences of length m with Golay sequences of length n in order to construct Golay sequences of length mn. We say that Golay sequences of length n are constructible if they can be manufactured from...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000